Multi-User Small Base Station Association via Contextual Combinatorial Volatile Bandits
نویسندگان
چکیده
We propose an efficient mobility management solution to the problem of assigning small base stations (SBSs) multiple mobile data users in a heterogeneous setting. formalize using novel sequential decision-making model named contextual combinatorial volatile multi-armed bandits (MABs), which each association is considered as arm, volatility arm imposed by dynamic arrivals users, and context additional information linked with user SBS such user/SBS distance transmission frequency. As next-generation communications are envisioned take place over highly links millimeter wave (mmWave) frequency band, we consider unknown channel distribution limited feedback form acknowledgments under absence state (CSI). dynamically varying, assignment cannot be solved offline. Thus, online algorithm able solve user-SBS multi-user time-varying environment, where number varies time. Our strikes balance between exploration exploitation achieves sublinear time regret optimal dependence on structure dynamics departures. In addition, demonstrate via numerical experiments that our significant performance gains compared several benchmark algorithms.
منابع مشابه
Contextual Combinatorial Cascading Bandits
We propose the contextual combinatorial cascading bandits, a combinatorial online learning game, where at each time step a learning agent is given a set of contextual information, then selects a list of items, and observes stochastic outcomes of a prefix in the selected items by some stopping criterion. In online recommendation, the stopping criterion might be the first item a user selects; in ...
متن کاملContextual Multi-Armed Bandits
We study contextual multi-armed bandit problems where the context comes from a metric space and the payoff satisfies a Lipschitz condition with respect to the metric. Abstractly, a contextual multi-armed bandit problem models a situation where, in a sequence of independent trials, an online algorithm chooses, based on a given context (side information), an action from a set of possible actions ...
متن کاملUser-Base-Station Association in HetSNets: Complexity and Efficient Algorithms
This work considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, which are maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plusnoise ...
متن کاملMulti-Task Learning for Contextual Bandits
Contextual bandits are a form of multi-armed bandit in which the agent has access to predictive side information (known as the context) for each arm at each time step, and have been used to model personalized news recommendation, ad placement, and other applications. In this work, we propose a multi-task learning framework for contextual bandit problems. Like multi-task learning in the batch se...
متن کاملContextual Multi-armed Bandits under Feature Uncertainty
We study contextual multi-armed bandit problems under linear realizability on rewards and uncertainty (or noise) on features. For the case of identical noise on features across actions, we propose an algorithm, coined NLinRel, having O ( T 7 8 ( log (dT ) +K √ d )) regret bound for T rounds, K actions, and d-dimensional feature vectors. Next, for the case of non-identical noise, we observe that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2021
ISSN: ['1558-0857', '0090-6778']
DOI: https://doi.org/10.1109/tcomm.2021.3064939